On the existence of Johnson polynomials for p-groups

نویسندگان

  • Mark L. Lewis
  • S. K. Prajapati
  • MARK L. LEWIS
  • S. K. PRAJAPATI
چکیده

Let G be a finite p-group. We say that G has a Johnson polynomial if there exists a polynomial f(x) ∈ Q[x] and a character χ ∈ Irr(G) so that f(χ) equals the total character for G. In this paper, we show that if G has nilpotence class 2, then G has a Johnson polynomial if and only if Z(G) is cyclic, and we show that if |cd(G)| = 2, then G has a Johnson polynomial if and only if G has nilpotence class 2 and Z(G) is cyclic.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Symmetry classes of polynomials associated with the dihedral group

‎In this paper‎, ‎we obtain the dimensions of symmetry classes of polynomials associated with‎ ‎the irreducible characters of the dihedral group as a subgroup of‎ ‎the full symmetric group‎. ‎Then we discuss the existence of o-basis‎ ‎of these classes‎.

متن کامل

Medication Adherence Among Elderly With Hypertension: Johnson Model-Based Program

Objectives Hypertension is the most common cause of stroke and kidney failure in the elderly and medication adherence is vital in controlling complications. This study aims to determine the effect of the Johnson model-based program on medication adherence among the elderly with hypertension. Methods & Materials The present study was a clinical trial that was performed on the elderly with hyper...

متن کامل

Some results on vertex-edge Wiener polynomials and indices of graphs

The vertex-edge Wiener polynomials of a simple connected graph are defined based on the distances between vertices and edges of that graph. The first derivative of these polynomials at one are called the vertex-edge Wiener indices. In this paper, we express some basic properties of the first and second vertex-edge Wiener polynomials of simple connected graphs and compare the first and second ve...

متن کامل

Numerical solution of nonlinear Fredholm-Volterra integral equations via Bell polynomials

In this paper, we propose and analyze an efficient matrix method based on Bell polynomials for numerically solving nonlinear Fredholm- Volterra integral equations. For this aim, first we calculate operational matrix of integration and product based on Bell polynomials. By using these matrices, nonlinear Fredholm-Volterra integral equations reduce to the system of nonlinear algebraic equations w...

متن کامل

Partial proof of Graham Higman's conjecture related to coset diagrams

Graham Higman has defined coset diagrams for PSL(2,ℤ). These diagrams are composed of fragments, and the fragments are further composed of two or more circuits. Q. Mushtaq has proved in 1983 that existence of a certain fragment γ of a coset diagram in a coset diagram is a polynomial f in ℤ[z]. Higman has conjectured that, the polynomials related to the fragments are monic and for a fixed degree...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013